An Intriguing Logic with Two Implicational Connectives
نویسندگان
چکیده
منابع مشابه
An Intriguing Logic with Two Implicational Connectives
Matthew Spinks [35] introduces implicative BCSK-algebras, expanding implicative BCK-algebras with an additional binary operation. Subdirectly irreducible implicative BCSK-algebras can be viewed as flat posets with two operations coinciding only in the 1and 2-element cases, each, in the latter case, giving the two-valued implication truth-function. We introduce the resulting logic (for the gener...
متن کاملImplicational (semilinear) logics II: additional connectives and characterizations of semilinearity
This is the continuation of the paper [4]. We continue the abstract study of non-classical logics based on the kind of generalized implication connectives they possess and we focus on semilinear logics, i.e. those that are complete with respect to the class of models where the implication defines a linear order. We obtain general characterizations of semilinearity in terms of the intersection-p...
متن کاملRepresenting Propositional Logic Connectives With Modular Polynomials
This paper explores the relationship between n-valued propositional logic connectives and modular polynomials. Namely the representing of logic connectives using modular polynomials. The case for n = 2 is explored and a method is developed for finding the coefficients of the unique polynomial that represents any given binary logic connective. Examples are then given for using the modular polyno...
متن کاملABSTRACTS A1.1 Mathematical Logic On Implicational Connectives of Quantum Logics for Non-commutative Substructural Logics formulated Gentzen-style Natural Deduction
S A1.1 Mathematical Logic On Implicational Connectives of Quantum Logics for Non-commutative Substructural Logics formulated Gentzen-style Natural Deduction Takeshi Ueno, Food Science and Human Wellnes, Rakuno-Gakuen University, Ebetsu, JAPAN See below for abstract. A theory for systems of propositions referring to each other Denis Saveliev, Institute for Information Transmission Problems, Russ...
متن کاملProof-graphs for Minimal Implicational Logic
It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their respective non-normal proofs. The aim of this work is to study how to reduce the weight of propositional deductions. We present the formalism of proof-graphs for purely implicational logic, which are graphs of a specific ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2000
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1027953481